nested word造句

In analogy to regular languages of words, a set " L " of nested words is called " regular " if it is accepted by some ( finite-state ) nested word automaton.
In analogy to regular languages of words, a set " L " of nested words is called " regular " if it is accepted by some ( finite-state ) nested word automaton.
In a nested word automaton, the position j in the nested word ( w, ?! ) might be a return position; if so, the state after reading w _ j will not only depend on the " linear state " in which the automaton was before reading w _ j, but also on a " hierarchical state " propagated by the automaton at the time it was in the corresponding call position.
In a nested word automaton, the position j in the nested word ( w, ?! ) might be a return position; if so, the state after reading w _ j will not only depend on the " linear state " in which the automaton was before reading w _ j, but also on a " hierarchical state " propagated by the automaton at the time it was in the corresponding call position.
It's difficult to find nested word in a sentence. 用nested word造句挺难的